Estimating the Largest Eigenvalue of a Positive Definite Matrix

نویسندگان

  • Dianne P. O'Leary
  • G. W. Stewart
  • James S. Vandergraft
  • JAMES S. VANDERGRAFT
چکیده

The power method for computing the dominant eigenvector of a positive definite matrix will converge slowly when the dominant eigenvalue is poorly separated from the next largest eigenvalue. In this note it is shown that in spite of this slow convergence, the Rayleigh quotient will often give a good approximation to the dominant eigenvalue after a very few iterations-even when the order of the matrix is large. Let A be a positive definite matrix of order n with eigenvalues Xj > X2 > • • • > X„ > 0 corresponding to the orthonormal system of eigenvectors xx,x2, . . . ,xn. In some applications, one must obtain an estimate of Xx without going to the expense of computing the complete eigensystem of A. A simple technique that is applicable to a variety of problems is the power method. Starting with a vector u0 of Euclidean norm unity (||«0||2 = 1), one iterates as follows: 1 1.1 1.2 1.3 1 loop for k := 0, 1, 2, vk := Auk; Pk :=uIvk' "fc + i := vk¡Hh> end loopThe theory of the method is well understood (e.g., see [4]). If Xx > X2 and x\u0 ^ 0, then the vectors uk converge linearly to Xj at a rate proportional to (X2/Xx)fc. The Rayleigh quotients pk converge to \x at a rate proportional to (X2/Xj)2fc. Convergence of the method can be hindered in two ways. First, if x^u0 is pathologically small compared to some of the numbers xfu0 (i > 1), then it will take many iterations for uk to become a good approximation to xr Second, if X2 is very near Xp the final rate of convergence will be slow. We can do very little about the first problem, except to note that it is unlikely to occur with a randomly chosen starting vector u0. Moreover, if our object is to compute the eigenvector xx, the only way to accelerate slow convergence due to an unfavorable ratio X2/Xj is to use more elaborate methods, such as simultaneous iteration [2], [3] or Lanczos tridiagonalization [1]. However, if we are only interested in a rough approximation to Xj, it will Received November 29, 1978. AMS (MOS) subject classifications (1970). Primary 65F15. ♦This work was supported in part by the office of Naval Research under Contract No. N0014-76-C-0391. © 1979 American Mathematical Society 0025-5718/79/0000-0162/$02.0

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A sharp upper bound on the largest Laplacian eigenvalue of weighted graphs

We consider weighted graphs, where the edge weights are positive definite matrices. The Laplacian of the graph is defined in the usual way. We obtain an upper bound on the largest eigenvalue of the Laplacian and characterize graphs for which the bound is attained. The classical bound of Anderson and Morley, for the largest eigenvalue of the Laplacian of an unweighted graph follows as a special ...

متن کامل

Estimating a Largest Eigenvector by Polynomial Algorithms with a Random Start

In 7] and 8], the power and Lanczos algorithms with random start for estimating the largest eigenvalue of an n n large symmetric positive deenite matrix were analyzed. In this paper we continue this study by estimating an eigenvector corresponding to the largest eigenvalue. We analyze polynomial algorithms using Krylov information for two error criteria: the randomized error and the randomized ...

متن کامل

A Schur–based algorithm for computing the smallest eigenvalue of a symmetric positive definite Toeplitz matrix

Recent progress in signal processing and estimation has generated considerable interest in the problem of computing the smallest eigenvalue of symmetric positive definite Toeplitz matrices. Several algorithms have been proposed in the literature. Many of them compute the smallest eigenvalue in an iterative fashion, relying on the Levinson–Durbin solution of sequences of Yule–Walker systems. Exp...

متن کامل

Stability results for approximation by positive definite functions on compact groups

We consider interpolation methods defined by positive definite functions on a compact group. Estimates for the smallest and largest eigenvalue of the interpolation matrix in terms of the localization of the positive definite function on G are presented and we provide a method to get positive definite functions explicitly on compact semisimple Lie groups. Finally we apply our results to construc...

متن کامل

A fast algorithm for computing the smallest eigenvalue of a symmetric positive-definite Toeplitz matrix

Recent progress in signal processing and estimation has generated considerable interest in the problem of computing the smallest eigenvalue of a symmetric positive definite Toeplitz matrix. Several algorithms have been proposed in the literature. Many of them compute the smallest eigenvalue in an iterative fashion, relying on the Levinson–Durbin solution of sequences of Yule–Walker systems. Exp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010